An Inverse Method for Parametric Timed Automata
نویسندگان
چکیده
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each value of parameters satisfying these constraints, the behaviors of the timed automata are time-abstract equivalent. We will exploit a reference valuation of the parameters that is supposed to capture a characteristic proper behavior of the system. The method has been implemented and is illustrated on various examples of asynchronous circuits.
منابع مشابه
An Extension of the Inverse Method to Probabilistic Timed Automata
Probabilistic timed automata can be used to model systems in which probabilistic and timing behaviour coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation π0 of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint K0 on timing parameters for which the reach...
متن کاملMerge and Conquer: State Merging in Parametric Timed Automata
Parameter synthesis for real-time systems aims at synthesizing dense sets of valuations for the timing requirements, guaranteeing a good behavior. A popular formalism for modeling parameterized realtime systems is parametric timed automata (PTAs). Compacting the state space of PTAs as much as possible is fundamental. We present here a state merging reduction based on convex union, that reduces ...
متن کاملLTL Model Checking of Parametric Timed Automata
The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symb...
متن کاملLearning-Based Compositional Parameter Synthesis for Event-Recording Automata
We address the verification of timed concurrent systems with unknown or uncertain constants considered as parameters. First, we introduce parametric event-recording automata (PERAs), as a new subclass of parametric timed automata (PTAs). Although in the nonparametric setting event-recording automata yield better decidability results than timed automata, we show that the most common decision pro...
متن کاملIMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
We present here IMITATOR II, a new version of IMITATOR, a tool implementing the “inverse method” for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation satisfying this constraint, the system behaves the same as under the reference valuation in terms of traces, i.e., alternating sequences of locations and actions. IM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 20 شماره
صفحات -
تاریخ انتشار 2008